#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
vector<LL> cal(LL x){
   LL sum=0;
   bool flag=false;
   vector<LL>v;
   while(x>0){
      sum=x%10;x/=10;
      if(!flag) {flag=true;continue;}
      else if(flag){
         v.push_back(sum);
      }
   }
   return v;
}
LL w(LL x){
   LL sum=0;
   while(x){
     sum++;x/=10;
   }
   return sum;
}
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
         LL n;cin>>n;
         if(n%10==9) n++;
         vector<LL>ans=cal(n);
         if(ans.size()==0){
            cout<<"0"<<endl;
         }
         else{
            for(LL i=ans.size()-1;i>=0;i--) cout<<ans[i];
            cout<<endl;
         }
    }
   	return 0;
}
